Representation Theorems for Multiple Belief Changes
نویسندگان
چکیده
This paper aims to develop further and systemize the theory of multiple belief change based on the previous work on the package contraction, developed by [Fuhrmann and Hansson 1994] and the general belief changes, developed by [Zhang 1996]. Two main representation theorems for general contractions are given, one is based on partial meet models and the other on nice-ordered partition models. An additional principle, called Limit Postulate, for the general belief changes is introduced which speci es properties of in nite belief changes. The results of this paper provides a foundation for investigating the connection between in nite nonmonotonic reasoning and multiple belief revision.
منابع مشابه
Explanations, belief revision and defeasible reasoning
We present different constructions for non-prioritized belief revision, that is, belief changes in which the input sentences are not always accepted. First, we present the concept of explanation in a deductive way. Second, we define multiple revision operators with respect to sets of sentences (representing explanations), giving representation theorems. Finally, we relate the formulated operato...
متن کاملRepresentation Theorems and the Foundations of Decision Theory∗
Representation theorems are often taken to provide the foundations for decision theory. First, they are taken to characterize degrees of belief and utilities. Second, they are taken to justify two fundamental rules of rationality: that we should have probabilistic degrees of belief and that we should act as expected utility maximizers. We argue that representation theorems cannot serve either o...
متن کاملConsidering Uncertainty in Modeling Historical Knowledge
Simplifying and structuring qualitatively complex knowledge, quantifying it in a certain way to make it reusable and easily accessible are all aspects that are not new to historians. Computer science is currently approaching a solution to some of these problems, or at least making it easier to work with historical data. In this paper, we propose a historical knowledge representation model takin...
متن کاملA Semantic Approach to Nonmonotonic Reasoning: Inference Operations and Choice
This paper presents a uniform semantic treatment of nonmonotonic inference operations that allow for inferences from infinite sets of premisses. The semantics is formulated in terms of selection functions and is a generalization of the preferential semantics of Shoham (1987), (1988), Kraus, Lehman, and Magidor (1990) and Makinson (1989), (1993). A selection function picks out from a given set o...
متن کاملrepresentation theorems of $L-$subsets and $L-$families on complete residuated lattice
In this paper, our purpose is twofold. Firstly, the tensor andresiduum operations on $L-$nested systems are introduced under thecondition of complete residuated lattice. Then we show that$L-$nested systems form a complete residuated lattice, which isprecisely the classical isomorphic object of complete residuatedpower set lattice. Thus the new representation theorem of$L-$subsets on complete re...
متن کامل